Operations to support temporal coverage aggregates over moving regions

A temporal coverage operation computes the duration that a moving object covers a spatial area. We extend this notion into temporal coverage aggregates, in which the spatial area covered for a maximum or minimum amount of time by a moving region, or set of moving regions, is discovered. We define the max temporal aggregate coverage operation and the min temporal aggregate coverage operation. We provide an algorithm to compute these operations, and show that it is correct. Finally, the algorithm is implemented in the open source, Pyspatiotemporalgeom library to verify the algorithm under a variety of test cases.